Unsupervised Feature Selection Based on Low-Rank Regularized Self-Representation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Self-representation based dual-graph regularized feature selection clustering

Feature selection algorithms eliminate irrelevant and redundant features, even the noise, while preserving the most representative features. They can reduce the dimension of the dataset, extract essential features in high dimensional data and improve learning quality. Existing feature selection algorithms are all carried out in data space. However, the information of feature space cannot be ful...

متن کامل

Gene Feature Extraction Based on Nonnegative Dual Graph Regularized Latent Low-Rank Representation

Aiming at the problem of gene expression profile's high redundancy and heavy noise, a new feature extraction model based on nonnegative dual graph regularized latent low-rank representation (NNDGLLRR) is presented on the basis of latent low-rank representation (Lat-LRR). By introducing dual graph manifold regularized constraint, the NNDGLLRR can keep the internal spatial structure of the origin...

متن کامل

Deep Unsupervised Domain Adaptation for Image Classification via Low Rank Representation Learning

Domain adaptation is a powerful technique given a wide amount of labeled data from similar attributes in different domains. In real-world applications, there is a huge number of data but almost more of them are unlabeled. It is effective in image classification where it is expensive and time-consuming to obtain adequate label data. We propose a novel method named DALRRL, which consists of deep ...

متن کامل

l2, 1-Norm Regularized Discriminative Feature Selection for Unsupervised Learning

Compared with supervised learning for feature selection, it is muchmore difficult to select the discriminative features in unsupervised learning due to the lack of label information. Traditional unsupervised feature selection algorithms usually select the features which best preserve the data distribution, e.g., manifold structure, of the whole feature set. Under the assumption that the class l...

متن کامل

Low-rank representation based discriminative projection for robust feature extraction

The low-rank representation (LRR) was presented recently and showed effective and robust for subspace segmentation. This paper presents a LRR-based discriminative projection method (LRR-DP) for robust feature extraction, by virtue of the underlying low-rank structure of data represesntation revealed by LRR. LRR-DP seeks a linear transformation such that in the transformed space, the betweenlarg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: OALib

سال: 2020

ISSN: 2333-9721,2333-9705

DOI: 10.4236/oalib.1106274